Which Faber–Moore–Chen digraphs are Cayley digraphs?

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Which digraphs are round?

A digraph D is round if the vertices of D can be circularly ordered as VI, V2, ... , Vn so that, for each vertex Vi, the out-neighbours of Vi appear consecutively following Vi and the in-neighbours of Vi appear consecutively preceding Vi in the ordering. We characterize round digraphs in terms of forbidden substructures. Our proof implies a polynomial algorithm to decide if a digraph is round.

متن کامل

Large Cayley digraphs and bipartite Cayley digraphs of odd diameters

Let Cd,k be the largest number of vertices in a Cayley digraph of degree d and diameter k, and let BCd,k be the largest order of a bipartite Cayley digraph for given d and k. For every degree d ≥ 2 and for every odd k we construct Cayley digraphs of order 2k ( ⌊d2⌋ )k and diameter at most k, where k ≥ 3, and bipartite Cayley digraphs of order 2(k − 1) ( ⌊d2⌋ )k−1 and diameter at most k, where k...

متن کامل

Generalized Cayley Digraphs

In this paper we introduce a new class of digraphs induced by groups. These digraphs can be considered as the generalization of Cayley digraphs. Moreover, various graph properties are expressed in terms of algebraic properties. This did not attract much attention in the literature. Mathematics Subject Classification: 05C25

متن کامل

Cayley digraphs and lexicographic product ∗

In this paper, we prove that a Cayley digraph Γ = Cay(G, S) is a nontrivial lexicographical product if and only if there is a nontrivial subgroup H of G such that S \ H is a union of some double cosets of H in G.

متن کامل

On the Cayley Digraphs That Are Patterns of Unitary Matrices

Study the relationship between unitary matrices and their patterns is motivated by works in quantum chaology (see, e.g., [KS99]) and quantum computation (see, e.g., [M96] and [AKV01]). We prove that if a Cayley digraph is a line digraph then it is the pattern of a unitary matrix. We prove that for any finite group with two generators there exists a set of generators such that the Cayley digraph...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2010

ISSN: 0012-365X

DOI: 10.1016/j.disc.2010.04.020